Reasoning with Prioritized Defaults
نویسندگان
چکیده
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a domain independent system of axioms, written as an extended logic program, which deenes reasoning with prioritized defaults. These axioms are used in conjunction with a description of a particular domain encoded in a simple language allowing representation of defaults and their priorities. Such domain descriptions are of course domain dependent and should be speciied by the users. We give suucient conditions for consistency of domain descriptions and illustrate the use of our system by formalizing various examples from the literature. Unlike many other approaches to formalizing reasoning with priorities ours does not require development of the new semantics of the language. Instead, the meaning of statements in the domain description is given by the system of (domain independent) axioms. We believe that in many cases this leads to simpler and more intuitive formalization of reasoning examples. We also present some discussion of diierences between various formalizations.
منابع مشابه
Nonmonotonic Reasoning With Web-Based Social Networks
A drawback of traditional default logic is that there is no general mechanism for preferring one default rule over another. To remedy this problem, numerous default logics augmented with priority relations have been introduced. In this paper, we show how trust values, derived from web-based social networks, can be used to prioritize defaults. We provide a coupling between the method for computi...
متن کاملUsing Social Network-based Trust For Default Reasoning On The Web
A drawback of traditional default logic is that there is no general mechanism for preferring one default rule over another. To remedy this problem, numerous default logics augmented with priority relations have been introduced. In this paper, we show how trust values, derived from web-based social networks, can be used to prioritize defaults. We provide a coupling between the method for computi...
متن کاملNonmonotonic Reasoning as SAT Search
In this paper we show that there is a direct correspondence between prioritized propositional nonmonotonic reasoning and SAT search. This correspondence leads to two results. First, we can reason eeciently using a SAT oracle. We explore several algorithms for nding models for prioritized propositional circumscriptive theories and show that there are some cases where some of the models can not b...
متن کاملA Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. 1 Introduction Of all the approaches to nonmonotonic reasoning, Mc-Carthy's circumscription [McCarthy, 1980, M...
متن کاملNonmonotonic Reasoning as Prioritized Argumentation
This paper proposes a formalism for nonmonotonic reasoning based on prioritized argumentation. We argue that nonmonotonic reasoning in general can be viewed as selecting monotonic inferences by a simple notion of priority among inference rules. More importantly, these types of constrained inferences can be speciied in a knowledge representation language where a theory consists of a collection o...
متن کامل